Test-Case Generation for Maude Functional Modules
نویسنده
چکیده
Testing takes much of the time of the software development process, so several efforts have been devoted to automate it. We present here a tool that is able to generate test cases for Maude functional modules, and check their correctness with respect to a given specification or select a subset of these test cases to be checked by the user by using different strategies. Since these processes are very expensive we also present different trusting techniques to ease them.
منابع مشابه
Towards Maude 2.0
Maude 2.0 is the new version of the Maude rewriting logic language currently under development. Maude 2.0's three main goals are: (i) greater generality and expres-siveness; (ii) eecient support for a wider range of programming applications; and (iii) usability as a key component for developing internet programming and mobile computing systems. To meet these goals, a number of new features have...
متن کاملMaude: Speciication and Programming in Rewriting Logic ?
Maude is a high-level language and a high-performance system supporting exe-cutable speciication and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational speciication and programming in its sublanguage of functional modules and theories. The underlying equational logic chosen for Maude is membership equational logic, that ha...
متن کاملA Declarative Debugger for Maude Functional Modules
A declarative debugger for Maude functional modules, which correspond to executable specifications in membership equational logic, is presented. Starting from an incorrect computation, declarative debugging builds a debugging tree as a logical representation of the computation, that then is traversed by asking questions to an external oracle until the error is found. We summarize the constructi...
متن کاملDeclarative Debugging of Membership Equational Logic Specifications
Algorithmic debugging has been applied to many declarative programming paradigms; in this paper, it is applied to the rewriting paradigm embodied in Maude. We introduce a declarative debugger for executable specifications in membership equational logic which correspond to Maude functional modules. Declarative debugging is based on the construction and navigation of a debugging tree which logica...
متن کاملDeclarative Debugging of Maude Modules∗
We introduce a declarative debugger for Maude modules: functional modules correspond to executable specifications in membership equational logic, while system modules correspond to rewrite theories. First we describe the construction of appropriate debugging trees for oriented equational and membership inferences and rewrite rules. These trees are obtained as the result of collapsing in proof t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010